Current Issue : October - December Volume : 2020 Issue Number : 4 Articles : 5 Articles
The advent of technology has opened unprecedented opportunities in health\ncare delivery system as the demand for intelligent and knowledge-based systems\nhas increased as modern medical practices become more knowledge-intensive.\nAs a result of this, there is greater need to investigate the pervasiveness of software\nfaults in Safety critical medical systems for proper diagnosis. The sheer\nvolume of code in these systems creates significant concerns about the quality\nof the software. The rate of untimely deaths nowadays is alarming partly due\nto the medical device used to carry out the diagnosis process. A safety-critical\nmedical (SCM) system is a complex system in which the malfunctioning of\nsoftware could result in death, injury of the patient or damage to the environment.\nThe malfunctioning of the software could be as a result of the inadequacy\nin software testing due to test suit problem or oracle problem. Testing a SCM\nsystem poses great challenges to software testers. One of these challenges is the\nneed to generate a limited number of test cases of a given regression test suite\nin a manner that does not compromise its defect detection ability. This paper\npresents a novel five-stage fault-based testing procedure for SCM, a model-based\napproach to generate test cases for differential diagnosis of Tuberculosis. We\nused Prime Path Coverage and Edge-Pair Coverage as coverage criteria to ensure\nmaximum coverage to identify feasible paths. We analyzed the proposed\ntesting procedure with the help of three metrics consisting of Fault Detection\nDensity, Fault Detection Effectiveness and Mutation Adequacy Score. We evaluated\nthe effectiveness of our testing procedure by running the suggested test\ncases on a sample historical data of tuberculosis patients. The experimental results\nshow that our developed testing procedure has some advantages such as\ncreating mutant graphs and Fuzzy Cognitive Map Engine while resolving the\nproblem of eliminating infeasible test cases for effective decision making....
With the increasing application of advanced video coding (H.264/AVC) in the multimedia field, a great significance to research in\nvideo watermarking based on this video compression standard has been established. We propose a semifragile video watermarking\nalgorithm, which can simultaneously implement frame attack and video tamper detection, herein. In this paper, the frame number\nis selected as the watermark information, and the relationship of the discrete cosine transform (DCT) nonzero coefficients is used as\nthe authentication code. The 4 * 4 subblocks, whose DCT nonzero coefficients are sufficiently complex, are selected to embed the\nwatermark. The parities of these nonzero coefficients in the medium frequency are modulated to embed watermarks. The\nexperimental results show that the visual quality of the embedded watermarked video is virtually unaffected, and the algorithm\nexhibits good robustness. Furthermore, the algorithm can correctly implement frame attack and video tamper detection....
Software programs are always prone to change for several reasons. In a software\nproduct line, the change is more often as many software units are carried\nfrom one release to another. Also, other new files are added to the reused\nfiles. In this work, we explore the possibility of building a model that can predict\nfiles with a high chance of experiencing the change from one release to\nanother. Knowing the files that are likely to face a change is vital because it\nwill help to improve the planning, managing resources, and reducing the cost.\nThis also helps to improve the software process, which should lead to better\nsoftware quality. Also, we explore how different learners perform in this context,\nand if the learning improves as the software evolved. Predicting change\nfrom a release to the next release was successful using logistic regression, J48,\nand random forest with accuracy and precision scored between 72% to 100%,\nrecall scored between 74% to 100%, and F-score scored between 80% to 100%.\nWe also found that there was no clear evidence regarding if the prediction\nperformance will ever improve as the project evolved....
In this paper, a method to initiate, develop and visualize an abstract syntax\ntree (AST) in C++ source code is presented. The approach is in chronological\norder starting with collection of program codes as a string and split into individual\ncharacters using regular expression. This will be followed by separating\nthe token grammar using best first search (BFS) algorithm to determine node\nhaving lowest value, lastly followed by graph presentation of intermediate representation\nachieved with the help of graph visualization software (Graph-\nViz) while former is implemented using python programming language version\n3. The efficacy of our approach is used in analyzing C++ code and\nyielded a satisfactory result....
In this work, intended for future teachers, we present a solution of a geometric\nlocus problem using the GeoGebra software. This allows first to visualize\nthe shape of the geometric locus, then to state a conjecture to validate a solution\nfounded by analytical geometry methods. The search for a geometric locus\nusing GeoGebra software makes the activity more attractive....
Loading....